Satisfying subtype inequalities in polynomial space
نویسندگان
چکیده
منابع مشابه
Satisfying Subtype Inequalities in Polynomial Space
This paper studies the complexity of type inference in-calculus with subtyping. Type inference is equivalent to solving systems of subtype inequalities. We consider simple types ordered structurally from an arbitrary set of base subtype assumptions. In this case, we give a PSPACE upper bound. Together with the known lower bound, this result settles completely the complexity of type inference ov...
متن کاملOn Bernstein Type Inequalities for Complex Polynomial
In this paper, we establish some Bernstein type inequalities for the complex polynomial. Our results constitute generalizations and refinements of some well-known polynomial inequalities.
متن کاملPolynomial Inequalities
Our main result is that every n-dimensional polytope can be described by at most (2n− 1) polynomial inequalities and, moreover, these polynomials can explicitly be constructed. For an n-dimensional pointed polyhedral cone we prove the bound 2n− 2 and for arbitrary polyhedra we get a constructible representation by 2n polynomial inequalities.
متن کاملextensions of some polynomial inequalities to the polar derivative
توسیع تعدادی از نامساوی های چند جمله ای در مشتق قطبی
15 صفحه اولOn Manifolds Satisfying Stable Systolic Inequalities
We show that for closed orientable manifolds the k-dimensional stable systole admits a metric-independent volume bound if and only if there are cohomology classes of degree k that generate cohomology in top-degree. Moreover, it turns out that in the nonorientable case such a bound does not exist for stable systoles of dimension at least two. Additionally, we prove that the stable systolic const...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 2002
ISSN: 0304-3975
DOI: 10.1016/s0304-3975(00)00314-5